Constraint Satisfaction Problems over semilattice block Mal'tsev algebras
نویسندگان
چکیده
منابع مشابه
A new algorithm for constraint satisfaction problems with Maltsev templates
In this article, we provide a new algorithm for solving constraint satisfaction problems with Maltsev constraints, based on the new notion of Maltsev consistency.
متن کاملConstraint Satisfaction Problems over Numeric Domains
We present a survey of complexity results for constraint satisfaction problems (CSPs) over the integers, the rationals, the reals, and the complex numbers. Examples of such problems are feasibility of linear programs, integer linear programming, the max-atoms problem, Hilbert’s tenth problem, and many more. Our particular focus is to identify those CSPs that can be solved in polynomial time, an...
متن کاملConstraint Satisfaction Search 1 Constraint Satisfaction Problems
For the past thirty ve years artiicial intelligence researchers have been studying heuristic search techniques. People writing AI programs have had strong intuitions about what it means for a program to search. Intuitively they classiied programs according to the kinds of search performed. Certain programs, such as matrix multiplication routines, did no search whatsoever. Other programs searche...
متن کاملThe complexity of constraint satisfaction problems for small relation algebras
The problems that deserve an attack demonstrate it by a counterattack. Abstract Andr eka and Maddux (1994, Notre Dame Journal of Formal Logic, 35(4)) classiied the small relation algebras | those with at most 8 elements, or in other terms, at most 3 atomic relations. They showed that there are eighteen isomorphism types of small relation algebras, all representable. For each simple, small relat...
متن کاملConstraint Satisfaction Search 1 Constraint Satisfaction Problems
For the past thirty ve years artiicial intelligence researchers have been studying heuristic search techniques. People writing AI programs have had strong intuitions about what it means for a program to search. Intuitively they classiied programs according to the kinds of search performed. Certain programs, such as matrix multiplication routines, did no search whatsoever. Other programs searche...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2019
ISSN: 0890-5401
DOI: 10.1016/j.ic.2019.104437